Skip-Splay: Toward Achieving the Unified Bound in the BST Model
نویسندگان
چکیده
We present skip-splay, the first binary search tree algorithm known to have a running time that nearly achieves the unified bound. Skip-splay trees require only O(m lg lg n + UB(σ)) time to execute a query sequence σ = σ1 . . . σm. The skip-splay algorithm is simple and similar to the splay algorithm.
منابع مشابه
Lecture 4 : BST Introduction and Treaps
1 Binary Search Tree 1.1 Operations We want to design a data structure, an ordered set S that supports the following operations: 1. Search(k, S) 2. Insert(k, S) 3. Delete(k, S) 4. Range(k, k ′ , S) ≡ |{k ∈ S|k ≤ k ≤ k}| If only (1), (2), (3) are required, we could use a hash table. However, if we also need (4), then we will need a BST. Definition 1.1. T is a BST for keys S if: 1. T is an ordere...
متن کاملGreedy Is an Almost Optimal Deque
In this paper we extend the geometric binary search tree (BST) model of Demaine, Harmon, Iacono, Kane, and Pǎtraşcu (DHIKP) to accommodate for insertions and deletions. Within this extended model, we study the online Greedy BST algorithm introduced by DHIKP. Greedy BST is known to be equivalent to a maximally greedy (but inherently offline) algorithm introduced independently by Lucas in 1988 an...
متن کاملThe landscape of bounds for binary search trees
Binary search trees (BSTs) with rotations can adapt to various kinds of structure in search sequences, achieving amortized access times substantially better than the Θ(logn) worst-case guarantee. Classical examples of structural properties include static optimality, sequential access, working set, key-independent optimality, and dynamic finger, all of which are now known to be achieved by the t...
متن کاملSelf-Adjusting Binary Search Trees: What Makes Them Tick?
Splay trees (Sleator and Tarjan [8]) satisfy the so-called access lemma. Many of the nice properties of splay trees follow from it. What makes self-adjusting binary search trees (BSTs) satisfy the access lemma? We propose a global view of BST algorithms, which allows us to identify general structural properties of algorithms that satisfy the access lemma. As an application of our techniques, we...
متن کاملDynamic Optimality and Multi-Splay Trees1
The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tan...
متن کامل